Matrix representations of frame and lifted-graphic matroids correspond to gain functions

نویسندگان

چکیده

Let M be a 3-connected matroid and let F field. A matrix over representing (G,B) biased graph M. We characterize the relationship between (G,B), settling four conjectures of Zaslavsky. show that for each representation M, is projectively equivalent to canonical arising from G as gain F+ or F× realizing B. Further, we projective equivalence classes representations are in one-to-one correspondence with switching graphs except one degenerate case.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrix representations of matroids of biased graphs correspond to gain functions

Let M be a frame matroid or a lifted-graphic matroid and let (G,B) be a biased graph representing M . Given a field F, a canonical F-representation of M particular to (G,B) is a matrix A arising from a gain function over the multiplicative or additive group of F that realizes (G,B). First, for a biased graph (G,B) that is properly unbalanced, loopless, and vertically 2-connected, we show that t...

متن کامل

Graphic Matroids

Matroid theory was first formalized in 1935 by Whitney [5] who introduced the notion as an attempt to study the properties of vector spaces in an abstract manner. Since then, matroids have proven to have numerous applications in a wide variety of fields including combinatorics and graph theory. Today we will briefly survey matroid representation and then discuss some problems in matroid optimiz...

متن کامل

On cographic matroids and signed-graphic matroids

We prove that a connected cographic matroid of a graph G is the bias matroid of a signed graph Σ iff G imbeds in the projective plane. In the case that G is nonplanar, we also show that Σ must be the projective-planar dual signed graph of an actual imbedding of G in the projective plane. As a corollary we get that, if G1, . . . , G29 denote the 29 nonseparable forbidden minors for projective-pl...

متن کامل

Branchwidth of graphic matroids

Answering a question of Geelen, Gerards, Robertson and Whittle [2], we prove that the branchwidth of a bridgeless graph is equal to the branchwidth of its cycle matroid. Our proof is based on branch-decompositions

متن کامل

Almost-Graphic Matroids

A nongraphic matroid M is said to be almost-graphic if, for all elements e, either M\e or M/e is graphic. We determine completely the class of almost-graphic matroids, thereby answering a question posed by Oxley in his book “Matroid Theory.” A nonregular matroid is said to be almost-regular if, for all elements e, either M\e or M/e is regular. An element e for which both M\e and M/e are regular...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 2022

ISSN: ['0095-8956', '1096-0902']

DOI: https://doi.org/10.1016/j.jctb.2022.02.007